def judge(n,s,t):
if s==t:
return 1
s1=n+1
t1=n+1
for i in range(1,n+1):
if s1==n+1 and s[i]==1:
s1=i
if t1==n+1 and t[i]==1:
t1=i
if s1!=n+1 and t1!=n+1:
break
if s1<=t1:
return 1
else:
return 0
q=int(input())
for _ in range(q):
n=int(input())
s=[0]+list(map(int,input()))
t=[0]+list(map(int,input()))
ans=judge(n,s,t)
if ans:
print("YES")
else:
print("NO")17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |